On Notions of Inductive Validity for First-Oder Equational Clauses
نویسندگان
چکیده
We define and discuss various conceivable notions of inductive validity for first-order equational clauses. This is done within the framework of constructor-based positive/negative conditional equational specifications which permits to treat negation and incomplete function definitions in an adequate and natural fashion. Moreover, we show that under some reasonable assumptions all these notions are monotonic w. r. t. consistent extension, in contrast to the case of inductive validity for initial semantics (of unconditional or positive conditional equations). In particular from a practical point of view, this monotonicity property is crucial since it allows for an incremental construction process of complex specifications where consistent extensions of specifications cannot destroy the validity of (already proved) inductive properties. Finally we show how various notions of inductive validity in the literature fit in or are related to our classification.
منابع مشابه
On Notions of Inductive
We deene and discuss various conceivable notions of induc-tive validity for rst-order equational clauses. This is done within the framework of constructor-based positive/negative conditional equational speciications which permits to treat negation and incomplete function deenitions in an adequate and natural fashion. Moreover, we show that under some reasonable assumptions all these notions are...
متن کاملInduction=I-Axiomatization+First-Order Consistency
In the early 80's, there was a number of papers on what should be called proofs by consistency. They describe how to perform inductive proofs, without using an explicit induction scheme, in the context of equational speciications and ground-convergent rewrite systems. The method was explicitly stated as a rst-order consistency proof in case of pure equational, constructor based, speciications. ...
متن کاملRewrite-Based Equational Theorem Proving with Selection and Simplification
We present various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses. Refutation completeness is established via the use of well-founded orderings on clauses for defining a Herbrand model for a consistent set of clauses. We also formulate an abstract notion of redundancy and show that the deletion of redundant c...
متن کاملFirst-order theorem proving modulo equations
We present refutationally complete calculi for first-order clauses with equality. General paramodulation calculi cannot efficiently deal with equations such as associativity and commutativity axioms. Therefore we will separate a set of equations (called E-equations) from a specification and give them a special treatment, avoiding paramodulations with E-equations but using E-unification for the ...
متن کاملEvolutionary Search in Inductive Equational Logic Programming
Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences th...
متن کامل